Search versus Knowledge for Solving Life and Death Problems in Go
نویسندگان
چکیده
In games research, Go is considered the classical board game that is most resistant to current AI techniques. Large-scale knowledge engineering has been considered indispensable for building state of the art programs, even for subproblems such as Life and Death, or tsume-Go. This paper describes the technologies behind TSUMEGO EXPLORER, a high-performance tsume-Go search engine for enclosed problems. In empirical testing, this engine outperforms GoTools, which has been the undisputedly best tsume-Go program for 15 years.
منابع مشابه
Generalized Widening
We present a new threat based search algorithm that outperforms other threat based search algorithms and selective knowledge-based for open life and death problem solving in the game of Go. It generalizes the Iterative Widening algorithm which consists in iteratively increasing the threat searched at the root. The main idea of Generalized Widening is to perform Iterative Widening at all max nod...
متن کاملForward Pruning and Other Heuristic Search Techniques in Tsume Go
GoTools is the name of a computer program to analyse life & death ghts in the game of go. First, a motivation for programing go is given. General aspects of the heuristic search performed in GoTools are discussed. The absolute strength and the eeect of forward tree pruning are tested in a competition between GoTools and dan level human players. It is found that with a speed up of a factor of 30...
متن کاملOptimizing GoTools' Search Heuristics using Genetic Algorithms
GoTools is a program which solves life & death problems in the game of Go. This paper describes experiments using a Genetic Algorithm to optimize heuristic weights used by GoTools’ tree-search. The complete set of heuristic weights is composed of di erent subgroups, each of which can be optimized with a suitable tness function. As a useful side product, an MPI interface for FreePascal was imple...
متن کاملDF-PN in Go: An Application to the One-Eye Problem
Search algorithms based on the notion of proof and disproof numbers have been shown to be effective in many games. In this paper, we modify the depth-first proof-number search algorithm df-pn, in order to apply it to the game of Go. We develop a solver for one-eye problems, a special case of enclosed tsume-Go [ life and death] problems. Our results show that this approach is very promising.
متن کاملA Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems
In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...
متن کامل